How long can one bluff in the domination game?
نویسندگان
چکیده
منابع مشابه
Paired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملDomination Game
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible and Staller wishes to delay the process as much as possible. The game domination number γg...
متن کاملHow long wavelengths can one extract from silica-core fibers?
The generation of wavelengths above 3 μm by nonlinear processes in short silica photonic crystal fibers is investigated numerically. It was found that wavelengths in the 3-3.5 μm range may be generated quite efficiently in centimeter-long fiber pieces when pumping with femtosecond pulses in the 1.55-2 μm range. Wavelengths in the range of 3.5-4 μm can in principle be generated, but these requir...
متن کاملHOW THE KONDO EFFECT CAN EXIST IN Gd INTERMETALLIC COMPOUNDS
Based on the crystal and magnetic structural properties of some Gd intermetallic compounds, it is shown that with increasing conduction electron concentration, Gd experiences electronic and magnetic instability, and that these behaviors point to the appearance of Kondo Lattice. We suggest that the conduction electrons have gained local character. It is shown that Kondo effect should be observed...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2017
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1899